Sciweavers

11394 search results - page 2102 / 2279
» Error-Correcting Data Structures
Sort
View
132
Voted
AAAI
2012
13 years 6 months ago
Modeling Textual Cohesion for Event Extraction
Event extraction systems typically locate the role fillers for an event by analyzing sentences in isolation and identifying each role filler independently of the others. We argu...
Ruihong Huang, Ellen Riloff
128
Voted
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 9 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
167
Voted
CN
2004
148views more  CN 2004»
15 years 3 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
DATAMINE
2008
95views more  DATAMINE 2008»
15 years 2 months ago
A dynamic bibliometric model for identifying online communities
Predictive modelling of online dynamic user-interaction recordings and community identifi cation from such data b ecomes more and more imp ortant w ith th e w idesp read use of on...
Xin Wang, Ata Kabán
123
Voted
BMCBI
2006
134views more  BMCBI 2006»
15 years 3 months ago
Application of machine learning in SNP discovery
Background: Single nucleotide polymorphisms (SNP) constitute more than 90% of the genetic variation, and hence can account for most trait differences among individuals in a given ...
Lakshmi K. Matukumalli, John J. Grefenstette, Davi...
« Prev « First page 2102 / 2279 Last » Next »