Sciweavers

6274 search results - page 219 / 1255
» From query complexity to computational complexity
Sort
View
CGI
1998
IEEE
15 years 9 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
156
Voted
NAACL
2010
15 years 2 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
CORR
2011
Springer
184views Education» more  CORR 2011»
14 years 8 months ago
Decision-Feedback Differential Detection in Impulse-Radio Ultra-Wideband Systems
—Building upon recent approaches for detection of impulse-radio ultra-wideband (IR-UWB) based on compressed sensing (CS), we combine this approach with techniques known from adva...
Andreas Schenk, Robert F. H. Fischer
SAC
2009
ACM
15 years 11 months ago
Building an efficient preference XML query processor
Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enablin...
SungRan Cho, Wolf-Tilo Balke
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
16 years 4 months ago
Energy-efficient monitoring of extreme values in sensor networks
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorit...
Adam Silberstein, Jun Yang 0001, Kamesh Munagala