Sciweavers

2600 search results - page 279 / 520
» Clustering with or without the Approximation
Sort
View
AIRWEB
2008
Springer
15 years 8 months ago
Robust PageRank and locally computable spam detection features
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
15 years 8 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 6 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
ICCAD
2009
IEEE
161views Hardware» more  ICCAD 2009»
15 years 3 months ago
The epsilon-approximation to discrete VT assignment for leakage power minimization
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
Yujia Feng, Shiyan Hu
CVPR
2001
IEEE
16 years 8 months ago
Geometric Distributions for Catadioptric Sensor Design
We present a general method of catadioptric sensor design for realizing prescribed projections. Our method makes use of geometric distributions in 3-dimensional space, which are g...
R. Andrew Hicks, Ronald K. Perline