Sciweavers

562 search results - page 87 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
INFOCOM
2006
IEEE
15 years 3 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
CIKM
2009
Springer
15 years 4 months ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
91
Voted
CIKM
2006
Springer
15 years 1 months ago
Eigen-trend: trend analysis in the blogosphere based on singular value decompositions
The blogosphere--the totality of blog-related Web sites-has become a great source of trend analysis in areas such as product survey, customer relationship, and marketing. Existing...
Yun Chi, Belle L. Tseng, Jun'ichi Tatemura
151
Voted
SIGMOD
2008
ACM
134views Database» more  SIGMOD 2008»
15 years 9 months ago
SystemT: a system for declarative information extraction
As applications within and outside the enterprise encounter increasing volumes of unstructured data, there has been renewed interest in the area of information extraction (IE) ? t...
Rajasekar Krishnamurthy, Yunyao Li, Sriram Raghava...
84
Voted
EUROGRAPHICS
2010
Eurographics
15 years 5 months ago
Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing
We present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose a standard ray tracing algorithm into several data-parallel stages tha...
Kirill Garanzha and Charles Loop