Sciweavers

255 search results - page 25 / 51
» Generalized Boosting Algorithms for Convex Optimization
Sort
View
NIPS
2003
13 years 10 months ago
AUC Optimization vs. Error Rate Minimization
The area under an ROC curve (AUC) is a criterion used in many applications to measure the quality of a classification algorithm. However, the objective function optimized in most...
Corinna Cortes, Mehryar Mohri
CIKM
2005
Springer
14 years 2 months ago
Optimizing cursor movement in holistic twig joins
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...
Marcus Fontoura, Vanja Josifovski, Eugene J. Sheki...
TKDE
2002
141views more  TKDE 2002»
13 years 8 months ago
Algorithms for Finding Attribute Value Group for Binary Segmentation of Categorical Databases
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...
Yasuhiko Morimoto, Takeshi Fukuda, Takeshi Tokuyam...
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
14 years 28 days ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
TWC
2008
135views more  TWC 2008»
13 years 8 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...