Sciweavers

4345 search results - page 800 / 869
» Temporal Constraint Networks
Sort
View
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 8 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
VLSID
2004
IEEE
107views VLSI» more  VLSID 2004»
14 years 8 months ago
Performance Analysis of Inter Cluster Communication Methods in VLIW Architecture
With increasing demands for high performance by embedded systems, especially by digital signal processing applications, embedded processors must increase available instruction lev...
Sourabh Saluja, Anshul Kumar
CHI
2004
ACM
14 years 8 months ago
A commonsense approach to predictive text entry
People cannot type as fast as they think, especially when faced with the constraints of mobile devices. There have been numerous approaches to solving this problem, including rese...
Tom Stocky, Alexander Faaborg, Henry Lieberman
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 8 months ago
Buffer overflow management in QoS switches
Abstract. We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the or...
Alexander Kesselman, Zvi Lotker, Yishay Mansour, B...
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 8 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu