583 search results - page 88 / 117 » Efficient algorithms for constructing decision trees with co... |
203
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
81
Voted
CN
2006
15 years 14 days ago
2006
The last decade has seen a deluge of proposals for supporting multicast in the Internet. These proposals can be categorized as either infrastructure-based, with the multicast func...
134
Voted
CDC
2008
IEEE
15 years 17 days ago
2008
IEEE
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
82
Voted
DATE
2007
IEEE
15 years 6 months ago
2007
IEEE
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
BNCOD
2004
15 years 1 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...