Sciweavers

4966 search results - page 898 / 994
» its 2010
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 10 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
DATE
2010
IEEE
175views Hardware» more  DATE 2010»
15 years 10 months ago
Approximate logic synthesis for error tolerant applications
─ Error tolerance formally captures the notion that – for a wide variety of applications including audio, video, graphics, and wireless communications – a defective chip that...
Doochul Shin, Sandeep K. Gupta
MPC
2010
Springer
174views Mathematics» more  MPC 2010»
15 years 10 months ago
Matrices as Arrows!
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
Hugo Daniel Macedo, José Nuno Oliveira
PET
2010
Springer
15 years 10 months ago
How Unique Is Your Web Browser?
We investigate the degree to which modern web browsers are subject to “device fingerprinting” via the version and configuration information that they will transmit to website...
Peter Eckersley
ECCV
2010
Springer
15 years 10 months ago
Accurate Image Localization Based on Google Maps Street View
Abstract. Finding an image’s exact GPS location is a challenging computer vision problem that has many real-world applications. In this paper, we address the problem of finding ...