Sciweavers

4137 search results - page 744 / 828
» On the number of matchings of a tree
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 1 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
DATE
2010
IEEE
154views Hardware» more  DATE 2010»
14 years 28 days ago
A method to remove deadlocks in Networks-on-Chips with Wormhole flow control
Networks-on-Chip (NoCs) are a promising interconnect paradigm to address the communication bottleneck of Systems-on-Chip (SoCs). Wormhole flow control is widely used as the trans...
Ciprian Seiculescu, Srinivasan Murali, Luca Benini...
PODS
2000
ACM
179views Database» more  PODS 2000»
14 years 6 days ago
Selectivity Estimation for Boolean Queries
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...
IDMS
1998
Springer
107views Multimedia» more  IDMS 1998»
14 years 2 days ago
Classifying Objectionable Websites Based on Image Content
This paper describes IBCOW Image-based Classi cation of Objectionable Websites, a system capable of classifying a website as objectionable or benign based on image content. The sys...
James Ze Wang, Jia Li, Gio Wiederhold, Oscar Firsc...
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
14 years 1 days ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore