Sciweavers

1282 search results - page 59 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
NIPS
2007
13 years 10 months ago
A New View of Automatic Relevance Determination
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
David P. Wipf, Srikantan S. Nagarajan
GI
2008
Springer
13 years 10 months ago
A Self-Organized Localization-Free Clustering Approach for Redundancy Exploitation in Large Wireless Sensor Networks
: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as pos...
Jakob Salzmann
LSSC
2005
Springer
14 years 2 months ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova
AAAI
1996
13 years 10 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
VLDB
2004
ACM
186views Database» more  VLDB 2004»
14 years 2 months ago
Indexing Large Human-Motion Databases
Data-driven animation has become the industry standard for computer games and many animated movies and special effects. In particular, motion capture data recorded from live actor...
Eamonn J. Keogh, Themis Palpanas, Victor B. Zordan...