Sciweavers

6315 search results - page 1179 / 1263
» Approximating Solution Structure
Sort
View
TACS
1994
Springer
14 years 2 months ago
Separate Abstract Interpretation for Control-Flow Analysis
Abstract Interpretation for Control-Flow Analysis Yan Mei Tang and Pierre Jouvelot CRI, Ecole des Mines de Paris, France Effect systems and abstract interpretation are two methods ...
Yan Mei Tang, Pierre Jouvelot
STOC
1990
ACM
135views Algorithms» more  STOC 1990»
14 years 2 months ago
A Separator Theorem for Graphs with an Excluded Minor and its Applications
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
Noga Alon, Paul D. Seymour, Robin Thomas
COMPGEOM
2007
ACM
14 years 1 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
KDD
2010
ACM
215views Data Mining» more  KDD 2010»
14 years 1 months ago
On the quality of inferring interests from social neighbors
This paper intends to provide some insights of a scientific problem: how likely one’s interests can be inferred from his/her social connections – friends, friends’ friends,...
Zhen Wen, Ching-Yung Lin
GBRPR
2007
Springer
14 years 1 months ago
Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
Christine Solnon, Jean-Michel Jolion
« Prev « First page 1179 / 1263 Last » Next »