Sciweavers

525 search results - page 105 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
CIKM
2009
Springer
13 years 11 months ago
An empirical study on using hidden markov model for search interface segmentation
This paper describes a hidden Markov model (HMM) based approach to perform search interface segmentation. Automatic processing of an interface is a must to access the invisible co...
Ritu Khare, Yuan An
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
11 years 8 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield
WWW
2005
ACM
14 years 7 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
BMCBI
2006
95views more  BMCBI 2006»
13 years 6 months ago
Discrete profile comparison using information bottleneck
Sequence homologs are an important source of information about proteins. Amino acid profiles, representing the position-specific mutation probabilities found in profiles, are a ri...
Sean O'Rourke, Gal Chechik, Robin Friedman, Eleaza...
DIMACS
1996
13 years 7 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin