Sciweavers

360 search results - page 14 / 72
» Precision-at-ten considered redundant
Sort
View
PODS
1993
ACM
161views Database» more  PODS 1993»
13 years 11 months ago
Blocking for External Graph Searching
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...
FMCAD
2008
Springer
13 years 9 months ago
Optimal Constraint-Preserving Netlist Simplification
Abstract-- We consider the problem of optimal netlist simplification in the presence of constraints. Because constraints restrict the reachable states of a netlist, they may enhanc...
Jason Baumgartner, Hari Mony, Adnan Aziz
CEC
2007
IEEE
14 years 1 months ago
A rigorous view on neutrality
Abstract—Motivated by neutrality observed in natural evolution often redundant encodings are used in evolutionary algorithms. Many experimental studies have been carried out on t...
Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus,...
BROADNETS
2004
IEEE
13 years 11 months ago
Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks
We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad hoc network. To reduce delays in the network, each user sends redundant packets along mu...
Michael J. Neely, Eytan Modiano
NIPS
2003
13 years 8 months ago
1-norm Support Vector Machines
The standard 2-norm SVM is known for its good performance in twoclass classi£cation. In this paper, we consider the 1-norm SVM. We argue that the 1-norm SVM may have some advanta...
Ji Zhu, Saharon Rosset, Trevor Hastie, Robert Tibs...