Sciweavers

325 search results - page 44 / 65
» Alternatives to two classic data structures
Sort
View
CJ
2004
99views more  CJ 2004»
14 years 9 months ago
Filters for XML-based Service Discovery in Pervasive Computing
Pervasive computing refers to an emerging trend towards numerous casually accessible devices connected to an increasingly ubiquitous network infrastructure. An important challenge...
Georgia Koloniari, Evaggelia Pitoura
TSP
2010
14 years 4 months ago
Learning graphical models for hypothesis testing and classification
Sparse graphical models have proven to be a flexible class of multivariate probability models for approximating high-dimensional distributions. In this paper, we propose techniques...
Vincent Y. F. Tan, Sujay Sanghavi, John W. Fisher ...
92
Voted
ISPASS
2006
IEEE
15 years 3 months ago
Modeling TCAM power for next generation network devices
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...
Banit Agrawal, Timothy Sherwood
IS
2007
14 years 9 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
SOFTVIS
2006
ACM
15 years 3 months ago
Visualizing live software systems in 3D
The analysis of the runtime behavior of a software system yields vast amounts of information, making accurate interpretations difficult. Filtering or compression techniques are o...
Orla Greevy, Michele Lanza, Christoph Wysseier