Sciweavers

683 search results - page 33 / 137
» A Fine-grained Analysis of a Simple Independent Set Algorith...
Sort
View
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
15 years 9 months ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...
ICML
2005
IEEE
16 years 4 months ago
Analysis and extension of spectral methods for nonlinear dimensionality reduction
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
Fei Sha, Lawrence K. Saul
100
Voted
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
15 years 10 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
141
Voted
GECCO
2007
Springer
189views Optimization» more  GECCO 2007»
15 years 7 months ago
A genetic algorithm with exon shuffling crossover for hard bin packing problems
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...
Philipp Rohlfshagen, John A. Bullinaria
129
Voted
IJON
2008
114views more  IJON 2008»
15 years 3 months ago
A robust model for spatiotemporal dependencies
Real-world data sets such as recordings from functional magnetic resonance imaging often possess both spatial and temporal structure. Here, we propose an algorithm including such ...
Fabian J. Theis, Peter Gruber, Ingo R. Keck, Elmar...