RICERCA ITALIANA     

Programmi di ricerca simili:

• 1 - MAINSTREAM: Algoritmi per strutture informative di grandi dimensioni e 'data streams'.
• 2 - Web Ram: web retrieval and mining
• 3 - Future applicazioni del paradigma peer-to-peer
• 4 - Metodi basati sulla similarita' per la visione artificiale e il riconoscimento delle forme: Teoria, algoritmi, applicazioni
• 5 - Modelli ed algoritmi per l'ottimizzazione robusta delle reti
• 6 - CARTOON - Context Aware RouTing Over Opportunistic Networks
• 7 - Sintesi automatica di modelli astratti a partire da dati temporali o spaziali
• 8 - Metodologie di progettazione di sistemi multiprocessore on-chip basati sul concetto di piattaforma
• 9 - La Geomatica a supporto delle azioni di Governo del Territorio
• 10 - Basi di dati crittografate

Classificazione scientifico-disciplinare

• Area scientifico disciplinare: Scienze matematiche e informatiche
  • INFORMATICA
• Area scientifico disciplinare: Ingegneria industriale e dell'informazione
  • SISTEMI DI ELABORAZIONE DELLE INFORMAZIONI

Classificazione brevettuale

• PHYSICS
  • COMPUTING; CALCULATING; COUNTING (score computers for games A63; combinations of writing applicances with computing devices B43K29/08)
    • ELECTRICAL DIGITAL DATA PROCESSING (computers in which a part of the computation is effected hydraulically or pneumatically G06D; optically G06E; self-contained input or output peripheral equipment G06K; impedance networks using digital techniques H03H) [C9603]

Classificazione geografica

• Regione: Lazio

Bibliografia

[AB+02] L.Arge, M.Bender et al, Cache-oblivious priority queue and graph algorithm applications, STOC 02, 268-276

[AC+94] B.Alpern, L.Carter et al, The Uniform Memory Hierarchy Model of Computation, Algorithmica 12:72-109, 1994

[AD91] J.Aslam, A.Dhagat. Searching in the presence of linearly bounded errors. STOC 91, 486-493

[AIS93] R.Agrawal, T.Imielinski, R.Srikant, Mining Association Rules between Sets of Items in Marge Databases, SIGMOD 93, 207-216

[AS94] R.Agrawal, R.Srikant, Fast Algorithms for Mining Association Rules, VLDB 94, 487-499

[B98] H.Bodlaender, A Partial k-arboretum of Graphs with Bounded Treewidth, TCS 209, 1-45, 1998

[B03] M.Brinkmeier, Communities in graphs, Innovative Internet Community Systems, IICS 03

[BBF03] C.Bachmaier, F.Brandenburg, M.Forster. Radial Level Planarity Testing and Embedding in Linear Time, GD 03, 393-405

[BC99] H.Burch, B.Cheswick, Mapping the Internet, IEEE Computer, 32, 1999

[BD+00] M.Bender, E.Demaine, Cache-oblivious B-trees, FOCS 00, 399-499

[BDLN02] C.Binucci, W.Didimo, G.Liotta, M.Nonato, Computing Labeled Orthogonal Drawings, GD 02, 66-73

[BF03] G.Brodal, R.Fagerberg, On the limits of cache-obliviousness, STOC 03, 307-315

[BF+01] G.Bilardi, C.Fantozzi et al, On the effectiveness of D-BSP as a bridging model of parallel computation, ICCS 01, 579-588

[BMR+00] A.Broder, F.Maghoul et al, Graph Structure in the Web, WWW 00

[BP98] S.Brin, L.Page. The anatomy of a large scale Hypertextual search engine, WWW 98

[BP01] G.Bilardi, E.Peserico, A Characterization of Temporal Locality and Its Portability across Memory Hierarchies, ICALP 01, 128-139

[BRRT03] A.Borodin, G.Roberts et al. Link analysis Ranking: Algorithms, experiments and theory. ACM Trans. on Internet Technology, 03

[CDDMP02] A.Carmignani, G.Di Battista et al., Visualization of the High Level Structure of the Internet with Hermes, J. Graph Algorithms & Appl., 6, 2002

[CDP04] L.Colitti, G.Di Battista, M.Patrignani, Discovering IPv6-in-IPv4 Tunnels in the Internet, NOMS 04

[CLGKP94] P.Chen, E.Lee et al. RAID: High-performance, reliable secondary storage. ACM Computing Surveys, 26, 145--185, 1994

[D59] E.Dijkstra. A note on two problems in connexion with graphs. Num. Mathematik, 1959

[D98] E.Dahlhaus: A Linear Time Algorithm to Recognize Clustered Graphs and Its Parallelization. LATIN 98, 239-248

[DD03] E.Di Giacomo, W.Didimo, Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves, GD 03, 419-424

[DDM01] G.Di Battista, W.Didimo, A.Marcandalli, Planarization of Clustered Graphs, GD 01, 60-74

[DETT99] G.Di Battista, P.Eades, R.Tamassia, I.Tollis, Graph Drawing, Prentice Hall, 1999

[DI01] C.Demetrescu, G.F.Italiano. Fully dynamic all pairs shortest paths with real edge weights. FOCS 01, 260-267

[DI03] C.Demetrescu, G.F.Italiano, A new approach to dynamic all pairs shortest paths, STOC 03, 159-166

[DK01] M.Dodge, R.Kitchin, Atlas of Cyberspace, Addison Wesley Ed., 2001

[DM03] E.Di Giacomo, H.Mejer, Track Drawings of Graphs with Constant Queue Number, GD 04, 214-225

[DPP03] G.Di Battista, M.Patrignani, M.Pizzonia, Computing the Types of the Relationships between Autonomous Systems, INFOCOM 03

[F02] M.Farach-Colton. Personal communication, 2002

[FG03] F.Franceschini, R.Grossi, Optimal Cache-Oblivious Implicit Dictionaries, ICALP 03, 316-331

[FI04] I.Finocchi, G.F.Italiano. Sorting and searching in the presence of memory faults (without redundancy), STOC 04

[FM00] P.Ferragina, G.Manzini. Opportunistic data structures with applications. FOCS 00

[FIMI03] Proc. IEEE Workshop on Frequent Itemset Mining Implementations 90, 2003

[FLG00] G.Flake, S.Lawrence, C.Giles, Efficient identification of Web communities, ACM SIGKDD Conf. Knowledge discovery & data mining, 150-160, 2000

[FJ98] M. Frigo, S. Johnson, FFTW: An adaptive software architecture for the FFT, ICASSP 98, 1381-1384.

[F+99] M.Frigo, C.Leiserson, H.Prokop, S.Ramachandran. Cache-oblivious algorithms. FOCS 99

[GKR98] D.Gibson, J.Kleinberg, P.Raghavan, Inferring Web communities from link topology, ACM Conf. Hypertext & hypermedia, 225-234, 1998

[GV00] R.Grossi, J.Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. STOC 00, 397--406

[HK01] J.Han, M.Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann, 2001

[HPY00] J.Han, J.Pei, Y.Yin, Mining Frequent Patterns without Candidate Generation, ACM SIGMOD 00, 1-12

[HWLT02] J.Han, J.Wang, Y.Lu, P.Tzvetkov, Mining Top-K Frequent Closed Patterns without Minimum Support, IEEE ICDM 02, 211-218

[ISO89] Int. Standards Organization: Intra-Domain IS-IS Routing Protocol, ISO-IEC JTC1/SC6 WG2N323, 1989

[JM03] M.Juenger, P.Mutzel, Graph Drawing Software: Mathematics and Visualization, Springer, 2003

[JV01] K.Jain, V.Vazirani. Application of Approximation Algorithms to Cooperative Games. STOC 01

[K98] J.Kleinberg. Authoritative sources in a hyperlinked environment. SODA 98

[K99] V.King. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. FOCS 99

[KH03] R.Kraft, E.Hastor. TimeLinks: Exploring the link structure of the evolving Web. WAW 03

[KW01] M.Kaufmann, D.Wagner, Drawing Graphs, Springer, 2001

[LLM+03] L.Laura, S.Leonardi et al. Algorithms and Experiments for the Webgraph. ESA 03

[LP02] F.Luccio, L.Pagli, Distributed Construction of Almost-Edge-Disjoint Spanning Trees via Dense Trees, 9th. ANaCC/ACM/IEEE Congress on Comp. Science Res.

[LPWH02] J.Liu, Y.Pan, et al. Mining Frequent Item Sets by Opportunistic Projection, ACM SIGKDD 02, 229-238

[M99] J.Moy, OSPF: Anatomy of an Internet Routing Protocol, Addison-Wesley, 1999

[MB98] R.Miller, K.Bharat. SPHINX: A Framework for Creating Personal, Site-Specific Web Crawlers. WWW 98

[NPW03] E.Nardelli, G.Proietti, P.Widmayer. Swapping a failing edge of a single source shortest path tree is good and fast. Algortimica, 35:56-74, 2003

[NZJ01] A.Ng, A.Zheng, M.Jordan. Stable algorithms for Link analysis. SIGIR 01

[OPPS02] S.Orlando, P.Palmerini, R.Perego, F.Silvestri, Adaptive and Resource-Aware Mining of Frequent Sets, IEEE ICDM 02, 338-345

[P+01] J.Pei et al., PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth, ICDE 01, 215-224

[PZ03] A.Pietracaprina, D.Zandolin, Mining Frequent Itemsets using Patricia Tries, FIMI, CEUR-WS On-line Proc., 90, 03

[RCMC00] K.Risden, M.Czerwinski et al., An initial examination of ease of use for 2D and 3D information visualizations of the web content, In. J. of Human Comp. Studies, 2000

[SA96] R.Srikant, R.Agrawal, Mining Sequential Patterns: Generalizations and Performance Improvements, EDBT 1996, 3-17

[SARK02] L.Subramanian, S.Agarwal et al., Characterizing the internet hierarchy from multiple vantage points, IEEE INFOCOM 02

[SH00] Ben-Shaul, M.Herscovici et al, Adding support for Dynamic and Focused Search with Fetuccino, manuscript

[SH95] S.Shenker. Making greed work in networks a game-theoretic analysis of switch service disciplines. IEEE/ACM Trans. Networking, 3, 819-831, 1995

[SMW02] N.Spring, R.Mahajan, D.Wetherall, Measuring ISP topologies with rocketfuel, ACM/SIGCOMM 02

[V90] L.Valiant, A Bridging Model for Parallel Computation, CACM 33(8):103-111, 1990

[VS94] J.Vitter, E.Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2), 1994

[WPD01] R. Whaley, A. Petitet, J. Dongarra, Automated Empirical Optimization of Software and the ATLAS Project Parallel Computing, 27(1-2):3-35, 2001.

[WD03] D.Wood, V.Dujmovic, Three-Dimensional Grid Drawings with Sub-Quadratic Volume, In Towards a Theory of Geometric Graphs, Contemporary Math. 342, AMS, to appear

[Y+03] K.Yotov et al, A Comparison of Empirical and Model-Driven Optimization, PLDI 03, 63-76

[Z01] M.Zaki, SPADE: An Efficient Algorithm for Mining Frequent Sequences, Machine Learning 42:31-60 2001

Parole Chiave

ALGORITMI; STRUTTURE DI DATI; INGEGNERIA DEGLI ALGORITMI; ALGORITMI SU GRAFI; ALGORITMI PER INTERNET; ALGORITMI PER IL WEB; MODELLI COMPUTAZIONALI; VISUALIZZAZIONE DELLE INFORMAZIONI