4112 search results - page 150 / 823 » Efficient Algorithms for the Spoonerism Problem |
146
click to vote
CRYPTO
2008
Springer
15 years 6 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
126
click to vote
ICAC
2005
IEEE
15 years 10 months ago
2005
IEEE
We present an architecture for and prototype of a system for quickly detecting software problem recurrences. Re-discovery of the same problem is very common in many large software...
141
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
131
Voted
JMLR
2010
14 years 11 months ago
2010
In this paper we consider a regularization approach to variable selection when the regression function depends nonlinearly on a few input variables. The proposed method is based o...
135
click to vote
IJCAI
2003
15 years 5 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...