2107 search results - page 67 / 422 » Computing Small Search Numbers in Linear Time |
124
Voted
COMPGEOM
1995
ACM
15 years 6 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
219
click to vote
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
Recently, the skyline computation and analysis have been extended from one single full space to multidimensional subspaces, which can lead to valuable insights in some application...
151
Voted
DLOG
1998
15 years 4 months ago
1998
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
103
Voted
TIT
2008
15 years 2 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
125
click to vote
CVPR
2003
IEEE
16 years 4 months ago
2003
IEEE
A linear programming technique is introduced that jointly performs feature selection and classifier training so that a subset of features is optimally selected together with the c...