Sciweavers

762 search results - page 32 / 153
» Finding Facilities Fast
Sort
View
JMLR
2010
149views more  JMLR 2010»
14 years 4 months ago
Fast Committee-Based Structure Learning
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
Ernest Mwebaze, John A. Quinn
EDBT
2006
ACM
174views Database» more  EDBT 2006»
15 years 9 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
15 years 4 months ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...
CSR
2006
Springer
15 years 1 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
DSD
2006
IEEE
109views Hardware» more  DSD 2006»
15 years 3 months ago
ATOMI II - Framework for Easy Building of Object-oriented Embedded Systems
Traditionally, an embedded system design process demands a considerable amount of expertise, time and money. This makes developing embedded systems difficult for many companies, a...
Tero Vallius, Juha Röning