Sciweavers

337 search results - page 66 / 68
» Network design with weighted players
Sort
View
NECO
2007
127views more  NECO 2007»
13 years 10 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
SDM
2012
SIAM
252views Data Mining» more  SDM 2012»
12 years 1 months ago
Learning from Heterogeneous Sources via Gradient Boosting Consensus
Multiple data sources containing different types of features may be available for a given task. For instance, users’ profiles can be used to build recommendation systems. In a...
Xiaoxiao Shi, Jean-François Paiement, David...
COCOA
2009
Springer
14 years 3 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
WWW
2003
ACM
14 years 11 months ago
Bridging the P2P and WWW Divide with DISCOVIR - DIStributed COntent-based Visual Information Retrieval
In the light of image retrieval evolving from text annotation to content-based and from standalone applications to web-based search engines, we foresee the need for deploying cont...
Ka Cheung Sia, Cheuk Hang Ng, Chi-Hang Chan
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 11 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau