Sciweavers

213 search results - page 4 / 43
» The randomized complexity of initial value problems
Sort
View
BMCBI
2008
95views more  BMCBI 2008»
13 years 7 months ago
Unsupervised reduction of random noise in complex data by a row-specific, sorted principal component-guided method
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
Joseph W. Foley, Fumiaki Katagiri
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
14 years 25 days ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 2 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 8 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
HICSS
2008
IEEE
91views Biometrics» more  HICSS 2008»
14 years 2 months ago
Governance Structures in Cross-Boundary Information Sharing: Lessons from State and Local Criminal Justice Initiatives
Governments are increasingly using collaborative, cross-boundary strategies to face complex social problems. Many of these cross-boundary initiatives have at their core the use, a...
Theresa A. Pardo, José Ramón Gil-Gar...