Sciweavers

1523 search results - page 128 / 305
» The Computational Complexity of Linear Optics
Sort
View
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 10 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
ESWS
2011
Springer
13 years 1 months ago
Optimizing Query Shortcuts in RDF Databases
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
Vicky Dritsou, Panos Constantopoulos, Antonios Del...
CVPR
2010
IEEE
14 years 6 months ago
Efficient Histogram-Based Sliding Window
Many computer vision problems rely on computing histogram-based objective functions with a sliding window. A main limiting factor is the high computational cost. Existing computat...
Yichen Wei, Litian Tao
ICNP
2006
IEEE
14 years 4 months ago
Robust Path-Vector Routing Despite Inconsistent Route Preferences
— Some commonly used inter-domain-routing policies—e.g., those using BGP’s MED attribute for cold-potato routing—are beyond the scope of routing theory developed to date. T...
Aaron D. Jaggard, Vijay Ramachandran
CAIP
2007
Springer
150views Image Analysis» more  CAIP 2007»
14 years 4 months ago
Junction Detection and Multi-orientation Analysis Using Streamlines
We present a novel method to detect multimodal regions composed of linear structures and measure the orientations in these regions, i.e. at line X-sings, T-junctions and Y-forks. I...
Frank G. A. Faas, Lucas J. van Vliet