Sciweavers

SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 11 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
RSS
2007
134views Robotics» more  RSS 2007»
13 years 11 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
UAI
2008
13 years 11 months ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel
UAI
2008
13 years 11 months ago
Multi-View Learning over Structured and Non-Identical Outputs
In many machine learning problems, labeled training data is limited but unlabeled data is ample. Some of these problems have instances that can be factored into multiple views, ea...
Kuzman Ganchev, João Graça, John Bli...
PDPTA
2007
13 years 11 months ago
A Parallel Algorithm for Discrete Gabor Transforms
- Serial algorithms to evaluate the Gabor transform of a discrete signal are bound by the length of signal for which the transform can be evaluated. The time taken, if machine memo...
Kshitij Sudan, Nipun Saggar, Asok De
PDCN
2007
13 years 11 months ago
A new robust centralized DMX algorithm
In a distributed system, process synchronization is an important agenda. One of the major duties for process synchronization is mutual exclusion. This paper presents a new central...
Moharram Challenger, Vahid Khalilpour, Peyman Baya...
NIPS
2007
13 years 11 months ago
Selecting Observations against Adversarial Objectives
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
Andreas Krause, H. Brendan McMahan, Carlos Guestri...
NIPS
2007
13 years 11 months ago
Local Algorithms for Approximate Inference in Minor-Excluded Graphs
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
Kyomin Jung, Devavrat Shah
NIPS
2007
13 years 11 months ago
Active Preference Learning with Discrete Choice Data
We propose an active learning algorithm that learns a continuous valuation model from discrete preferences. The algorithm automatically decides what items are best presented to an...
Eric Brochu, Nando de Freitas, Abhijeet Ghosh
SIROCCO
2008
13 years 11 months ago
On the Power of Local Orientations
We consider a network represented by a simple connected undirected graph with N anonymous nodes that have local orientations, i.e. incident edges of each vertex have locally-unique...
Monika Steinová