Sciweavers

3946 search results - page 238 / 790
» The computational complexity of choice sets
Sort
View
TCS
2010
15 years 5 months ago
Iterative compression and exact algorithms
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mat...
CHI
2002
ACM
16 years 7 months ago
A flexible 3d sound system for interactive applications
We have developed a 3D sound system for headphones that allows real-time sound source and user displacement in a virtual acoustic environment. Because of a flexible design that us...
Lalya Gaye
186
Voted
ECCV
2002
Springer
16 years 8 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
CHI
2006
ACM
16 years 7 months ago
Why phishing works
To build systems shielding users from fraudulent (or phishing) websites, designers need to know which attack strategies work and why. This paper provides the first empirical evide...
Rachna Dhamija, J. D. Tygar, Marti A. Hearst
LCN
2008
IEEE
16 years 1 months ago
Experimental comparison of peer-to-peer streaming overlays: An application perspective
—Peer-to-peer streaming systems are becoming highly popular for IP Television (IPTV). Most systems can be categorized as either tree-based or mesh-based, and as either pushbased ...
Jeff Seibert, David Zage, Sonia Fahmy, Cristina Ni...