Sciweavers

953 search results - page 27 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
DSN
2004
IEEE
13 years 11 months ago
Evaluating the Impact of Limited Resource on the Performance of Flooding in Wireless Sensor Networks
Abstract-- Wireless sensor networks (WSNs) are large collections of resource limited nodes, densely deployed over a landscape. They gather and disseminate local data using multihop...
Patrick Downey, Rachel Cardell-Oliver
CCECE
2006
IEEE
14 years 1 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...
ISCAS
2005
IEEE
123views Hardware» more  ISCAS 2005»
14 years 1 months ago
Lower-bound estimation for multi-bitwidth scheduling
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
Junjuan Xu, Jason Cong, Xu Cheng
ICCV
2007
IEEE
13 years 11 months ago
ClassMap: Efficient Multiclass Recognition via Embeddings
In many computer vision applications, such as face recognition and hand pose estimation, we need systems that can recognize a very large number of classes. Large margin classifica...
Vassilis Athitsos, Alexandra Stefan, Quan Yuan, St...
ECCC
2010
143views more  ECCC 2010»
13 years 5 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran