Sciweavers

1068 search results - page 107 / 214
» Factorization as a Rank 1 Problem
Sort
View
JMLR
2010
159views more  JMLR 2010»
14 years 4 months ago
Inference of Sparse Networks with Unobserved Variables. Application to Gene Regulatory Networks
Networks are becoming a unifying framework for modeling complex systems and network inference problems are frequently encountered in many fields. Here, I develop and apply a gener...
Nikolai Slavov
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
15 years 10 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
FOCS
2004
IEEE
15 years 1 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
COMPGEOM
2011
ACM
14 years 1 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
FPGA
2003
ACM
117views FPGA» more  FPGA 2003»
15 years 3 months ago
PipeRoute: a pipelining-aware router for FPGAs
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
Akshay Sharma, Carl Ebeling, Scott Hauck