6315 search results - page 382 / 1263 » Approximating Solution Structure |
192
click to vote
INFOCOM
2003
IEEE
16 years 3 days ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
189
click to vote
WEBDB
2010
Springer
15 years 12 months ago
2010
Springer
Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogeneous dataset, where any given record has only a tiny fraction of all possible fields. Su...
172
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
204
click to vote
RANLP
2003
15 years 8 months ago
2003
Despite its state-of-the-art performance, the Data Oriented Parsing (DOP) model has been shown to suffer from biased parameter estimation, and the good performance seems more the ...
184
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: Many algorithms exist for protein structural alignment, based on internal protein coordinates or on explicit superposition of the structures. These methods are usually...