Sciweavers

2570 search results - page 183 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
CEAS
2006
Springer
15 years 7 months ago
Fast Uncertainty Sampling for Labeling Large E-mail Corpora
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
Richard Segal, Ted Markowitz, William Arnold
117
Voted
WWW
2007
ACM
16 years 4 months ago
Exploit sequencing views in semantic cache to accelerate xpath query evaluation
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
Jianhua Feng, Na Ta, Yong Zhang, Guoliang Li
138
Voted
SMA
1995
ACM
176views Solid Modeling» more  SMA 1995»
15 years 7 months ago
Incremental algorithms for collision detection between solid models
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...
Madhav K. Ponamgi, Dinesh Manocha, Ming C. Lin
117
Voted
ESA
2008
Springer
106views Algorithms» more  ESA 2008»
15 years 5 months ago
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms
In this paper, we study two fast algorithms--HashRF and PGM-Hashed--for computing the Robinson-Foulds (RF) distance matrix between a collection of evolutionary trees. The RF distan...
Seung-Jin Sul, Tiffani L. Williams
117
Voted
ICIP
2009
IEEE
15 years 1 months ago
Precise head segmentation on arbitrary backgrounds
We propose a method for segmentation of frontal human portraits from arbitrary unknown backgrounds. Semantic information is used to project the face into a normalized reference fr...
David C. Schneider, Benjamin Prestele, Peter Eiser...