Sciweavers

339 search results - page 66 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
13 years 9 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
CGF
2010
157views more  CGF 2010»
13 years 4 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen
ICDE
2003
IEEE
247views Database» more  ICDE 2003»
14 years 8 months ago
CLUSEQ: Efficient and Effective Sequence Clustering
Analyzing sequence data has become increasingly important recently in the area of biological sequences, text documents, web access logs, etc. In this paper, we investigate the pro...
Jiong Yang, Wei Wang 0010
WWW
2008
ACM
14 years 8 months ago
iRobot: an intelligent crawler for web forums
We study in this paper the Web forum crawling problem, which is a very fundamental step in many Web applications, such as search engine and Web data mining. As a typical user-crea...
Rui Cai, Jiang-Ming Yang, Wei Lai, Yida Wang, Lei ...
ICDE
2010
IEEE
801views Database» more  ICDE 2010»
14 years 7 months ago
The Similarity Join Database Operator
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
Mohamed H. Ali, Walid G. Aref, Yasin N. Silva