2191 search results - page 125 / 439 » Improving the Efficiency of Non-Deterministic Computations |
184
Voted
SIGMOD
2006
ACM
16 years 27 days ago
2006
ACM
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
88
Voted
APPT
2007
Springer
15 years 7 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
111
click to vote
COLT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
AUSDM
2006
Springer
15 years 4 months ago
2006
Springer
How to efficiently discard potentially uninteresting rules in exploratory rule discovery is one of the important research foci in data mining. Many researchers have presented algor...
103
Voted
NIPS
2008
15 years 2 months ago
2008
We consider the problem of multiple kernel learning (MKL), which can be formulated as a convex-concave problem. In the past, two efficient methods, i.e., Semi-Infinite Linear Prog...