Sciweavers

1487 search results - page 74 / 298
» The Computational Complexity of Link Building
Sort
View
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
16 years 1 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
CGI
1998
IEEE
15 years 5 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&...
CORR
2011
Springer
184views Education» more  CORR 2011»
14 years 5 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
CSCW
2004
ACM
15 years 7 months ago
Field studies of computer system administrators: analysis of system management tools and practices
Computer system administrators are the unsung heroes of the information age, working behind the scenes to configure, maintain, and troubleshoot the computer infrastructure that un...
Rob Barrett, Eser Kandogan, Paul P. Maglio, Eben M...
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 1 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...