Sciweavers

11211 search results - page 328 / 2243
» Data Structures
Sort
View
EMMCVPR
2011
Springer
14 years 6 months ago
Multiple-Instance Learning with Structured Bag Models
Traditional approaches to Multiple-Instance Learning (MIL) operate under the assumption that the instances of a bag are generated independently, and therefore typically learn an in...
Jonathan Warrell, Philip H. S. Torr
BMCBI
2004
208views more  BMCBI 2004»
15 years 6 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
SIGMOD
1999
ACM
112views Database» more  SIGMOD 1999»
15 years 11 months ago
A New Method for Similarity Indexing of Market Basket Data
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu
NIPS
2003
15 years 8 months ago
Ranking on Data Manifolds
The Google search engine has enjoyed huge success with its web page ranking algorithm, which exploits global, rather than local, hyperlink structure of the web using random walks....
Dengyong Zhou, Jason Weston, Arthur Gretton, Olivi...
DATESO
2009
119views Database» more  DATESO 2009»
15 years 4 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký