Sciweavers

10414 search results - page 277 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
CONEXT
2008
ACM
15 years 8 months ago
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
Jing Fu, Jennifer Rexford
NIPS
2008
15 years 8 months ago
On the Efficient Minimization of Classification Calibrated Surrogates
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...
Richard Nock, Frank Nielsen
DAGSTUHL
2004
15 years 8 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
HPCC
2010
Springer
15 years 7 months ago
Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...
Stefan Marr, Stijn Verhaegen, Bruno De Fraine, The...
CORR
2010
Springer
132views Education» more  CORR 2010»
15 years 6 months ago
ETP-Mine: An Efficient Method for Mining Transitional Patterns
A Transaction database contains a set of transactions along with items and their associated timestamps. Transitional patterns are the patterns which specify the dynamic behavior o...
B. Kiran Kumar