Sciweavers

9842 search results - page 1438 / 1969
» Compositional timing analysis
Sort
View
155
Voted
PUC
2007
90views more  PUC 2007»
15 years 7 months ago
Digital homes on wheels: designing for the unimagined home
Design for the digital home is often predicated on an ideal, imagined domestic space that is expansive, stable, occupied by a ‘‘busy’’ nuclear family, and does not always m...
Alexandra Zafiroglu, Michele Chang
236
Voted
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 6 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
215
Voted
INFOCOM
2010
IEEE
15 years 5 months ago
Neighbor Discovery with Reception Status Feedback to Transmitters
—Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighb...
Ramin Khalili, Dennis Goeckel, Donald F. Towsley, ...
267
Voted
BMCBI
2011
14 years 11 months ago
A user-friendly web portal for T-Coffee on supercomputers
Background: Parallel T-Coffee (PTC) was the first parallel implementation of the T-Coffee multiple sequence alignment tool. It is based on MPI and RMA mechanisms. Its purpose is t...
Josep Rius Torrento, Fernando Cores, Francesc Sols...
COMPGEOM
2011
ACM
14 years 11 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
« Prev « First page 1438 / 1969 Last » Next »