Sciweavers

104 search results - page 12 / 21
» The Partition Bound for Classical Communication Complexity a...
Sort
View
123
Voted
SIBGRAPI
2005
IEEE
15 years 9 months ago
Boolean Operations on Surfel-Bounded Objects Using Constrained BSP-Trees
Point-based modeling and rendering is an active area of research in Computer Graphics. The concept of points with attributes (e.g. normals) is usually referred to as surfels, and ...
Marcus A. C. Farias, Carlos Eduardo Scheidegger, J...
159
Voted
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
15 years 7 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
HPCA
2005
IEEE
15 years 9 months ago
Microarchitectural Wire Management for Performance and Power in Partitioned Architectures
Future high-performance billion-transistor processors are likely to employ partitioned architectures to achieve high clock speeds, high parallelism, low design complexity, and low...
Rajeev Balasubramonian, Naveen Muralimanohar, Kart...
114
Voted
COCOON
2005
Springer
15 years 9 months ago
A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm
Rocchio’s similarity-based relevance feedback algorithm, one of the most important query reformation methods in information retrieval, is essentially an adaptive supervised lear...
Zhixiang Chen, Bin Fu
119
Voted
STACS
2007
Springer
15 years 9 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom