Sciweavers

386 search results - page 35 / 78
» Fundamental Questions
Sort
View
COMGEO
2008
ACM
13 years 10 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
CORR
2008
Springer
84views Education» more  CORR 2008»
13 years 10 months ago
The emerging field of language dynamics
Large linguistic databases, especially databases having a global coverage such as The World Atlas of Language Structures (Haspelmath et al. 2005), The Automated Simility Judgment ...
Søren Wichmann
COMCOM
2006
150views more  COMCOM 2006»
13 years 10 months ago
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. ...
Mihaela Cardei, Jie Wu
JSA
2007
139views more  JSA 2007»
13 years 9 months ago
High-speed hardware implementations of Elliptic Curve Cryptography: A survey
For the last decade, Elliptic Curve Cryptography (ECC) has gained increasing acceptance in the industry and the academic community and has been the subject of several standards. T...
Guerric Meurice de Dormale, Jean-Jacques Quisquate...
CPC
2004
98views more  CPC 2004»
13 years 9 months ago
And/Or Trees Revisited
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
Brigitte Chauvin, Philippe Flajolet, Danièl...