Sciweavers

46 search results - page 6 / 10
» On the Complexity of Computing Short Linearly Independent Ve...
Sort
View
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 9 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...
CVPR
2008
IEEE
14 years 10 months ago
Classification using intersection kernel support vector machines is efficient
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can ...
Subhransu Maji, Alexander C. Berg, Jitendra Malik
MDM
2007
Springer
14 years 2 months ago
Near Optimal Update-Broadcast of Data Sets
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
Sachin Agarwal, Andrew Hagedorn, Ari Trachtenberg
WACV
2002
IEEE
14 years 1 months ago
Appearance-based Eye Gaze Estimation
We present a method for estimating eye gaze direction, which represents a departure from conventional eye gaze estimation methods, the majority of which are based on tracking spec...
Kar-Han Tan, David J. Kriegman, Narendra Ahuja
AAAI
2007
13 years 11 months ago
A Randomized String Kernel and Its Application to RNA Interference
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the seque...
Shibin Qiu, Terran Lane, Ljubomir J. Buturovic