Sciweavers

1345 search results - page 16 / 269
» A Class of Logarithmic Integrals
Sort
View
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 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
JAL
2006
100views more  JAL 2006»
13 years 8 months ago
Distance and routing labeling schemes for non-positively curved plane graphs
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
MOC
2002
98views more  MOC 2002»
13 years 8 months ago
Bounds for the smallest norm in an ideal class
We develop a method for obtaining upper bounds for the smallest norm among all norms of integral ideals in an ideal class. Applying this to number fields of small degree, we are ab...
Ana-Cecilia de la Maza
SIGCOMM
1998
ACM
14 years 29 days ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam
ECCV
2008
Springer
14 years 10 months ago
A Dynamic Conditional Random Field Model for Joint Labeling of Object and Scene Classes
Object detection and pixel-wise scene labeling have both been active research areas in recent years and impressive results have been reported for both tasks separately. The integra...
Christian Wojek, Bernt Schiele