Sciweavers

4865 search results - page 607 / 973
» The Complexity of Graph Connectivity
Sort
View
NIPS
2001
15 years 8 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
MM
2010
ACM
204views Multimedia» more  MM 2010»
15 years 7 months ago
Crew: cross-modal resource searching by exploiting wikipedia
In Web 2.0, users have generated and shared massive amounts of resources in various media formats, such as news, blogs, audios, photos and videos. The abundance and diversity of t...
Chen Liu, Beng Chin Ooi, Anthony K. H. Tung, Dongx...
ECCC
2006
88views more  ECCC 2006»
15 years 6 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
CORR
2004
Springer
124views Education» more  CORR 2004»
15 years 6 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
CGF
2002
94views more  CGF 2002»
15 years 6 months ago
Multiresolution Surfaces having Arbitrary Topologies by a Reverse Doo Subdivision Method
We have shown how to construct multiresolution structures for reversing subdivision rules using global least squares models 16. As a result, semiorthogonal wavelet systems have al...
Faramarz F. Samavati, N. Mahdavi-Amiri, Richard M....