Sciweavers

6266 search results - page 83 / 1254
» New results on the computability and complexity of points - ...
Sort
View
ESOP
2007
Springer
14 years 3 months ago
Computing Procedure Summaries for Interprocedural Analysis
Abstract. We describe a new technique for computing procedure summaries for performing an interprocedural analysis on programs. Procedure summaries are computed by performing a bac...
Sumit Gulwani, Ashish Tiwari
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
14 years 3 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
ENC
2004
IEEE
14 years 19 days ago
Graph-Based Point Relaxation for 3D Stippling
Point hierarchies are suitable for creating framecoherent animations of 3D models in non-photorealistic styles such as stippling, painterly and other artistic rendering. In this p...
Oscar Meruvia Pastor, Thomas Strotthote
CIVR
2007
Springer
361views Image Analysis» more  CIVR 2007»
14 years 3 months ago
Interpretability based interest points detection
This paper deals with a new interest points detector. Unlike most standard detectors which concentrate on the local shape of the signal, the main objective of this new operator is...
Ahmed Rebai, Alexis Joly, Nozha Boujemaa
CHI
2005
ACM
14 years 9 months ago
The bubble cursor: enhancing target acquisition by dynamic resizing of the cursor's activation area
We present the bubble cursor ? a new target acquisition technique based on area cursors. The bubble cursor improves upon area cursors by dynamically resizing its activation area d...
Tovi Grossman, Ravin Balakrishnan