921 search results - page 83 / 185 » New Data Structures for Orthogonal Range Searching |
144
click to vote
ICECCS
2007
IEEE
15 years 8 months ago
2007
IEEE
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that a...
290
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
With the amount of available text data in relational databases growing rapidly, the need for ordinary users to search such information is dramatically increasing. Even though the ...
129
click to vote
APBC
2004
15 years 5 months ago
2004
With the continued growth of three dimensional structural information databases comes a corresponding increase in interest in this data for the study of new sequences and an ever-...
182
Voted
JMLR
2010
14 years 11 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
119
click to vote
DELOS
2001
15 years 5 months ago
2001
We describe an approach to personalization that emphasizes the "client side." We posit the need for a highly individualistic user context that resides on the client mach...