Sciweavers

187 search results - page 24 / 38
» On the uniform edge-partition of a tree
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
14 years 10 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
71
Voted
EP
1998
Springer
15 years 1 months ago
Memory Scalability in Constraint-Based Multimedia Style Sheet Systems
Abstract. Multimedia style sheet systems uniformly use a constraintbased model of layout. Constraints provide a uniform mechanism for all aspects of style management and layout and...
Terry Cumaranatunge, Ethan V. Munson
JNW
2006
120views more  JNW 2006»
14 years 9 months ago
An EMST Based Look-up Protocol for Peer to Peer Networks
-- Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems a...
Tarun Bansal, Pankaj Ghanshani
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 1 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng
LICS
2008
IEEE
15 years 3 months ago
Collapsible Pushdown Automata and Recursion Schemes
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong...