Results 1  10
of
90,861
Spacetime Interest Points
 IN ICCV
, 2003
"... Local image features or interest points provide compact and abstract representations of patterns in an image. In this paper, we propose to extend the notion of spatial interest points into the spatiotemporal domain and show how the resulting features often reflect interesting events that can be use ..."
Abstract

Cited by 819 (21 self)
 Add to MetaCart
Local image features or interest points provide compact and abstract representations of patterns in an image. In this paper, we propose to extend the notion of spatial interest points into the spatiotemporal domain and show how the resulting features often reflect interesting events that can
Pointsto Analysis in Almost Linear Time
, 1996
"... We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a nons ..."
Abstract

Cited by 595 (3 self)
 Add to MetaCart
We present an interprocedural flowinsensitive pointsto analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest nontrivial interprocedural pointsto analysis algorithm yet described. The algorithm is based on a non
Clustering by passing messages between data points
 Science
, 2007
"... Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such “exemplars ” can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only if that initi ..."
Abstract

Cited by 696 (8 self)
 Add to MetaCart
Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such “exemplars ” can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 547 (12 self)
 Add to MetaCart
to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a
The R*tree: an efficient and robust access method for points and rectangles
 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1990
"... The Rtree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the ..."
Abstract

Cited by 1262 (74 self)
 Add to MetaCart
of the following two reasons 1 it efficiently supports point and spatial data at the same time and 2 its implementation cost is only slightly higher than that of other Rtrees.
An Efficient Solution to the FivePoint Relative Pose Problem
, 2004
"... An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degre ..."
Abstract

Cited by 484 (13 self)
 Add to MetaCart
in minimal as well as overdetermined cases. The performance is compared to that of the well known 8 and 7point methods and a 6point scheme. The algorithm is used in a robust hypothesizeandtest framework to estimate structure and motion in realtime with low delay. The realtime system uses solely visual
T Time point
"... The success of complex autonomous robotic systems depends on the quality and correctness of their fault tolerant control systems. A goalbased control approach is used to design an example control program for a proposed mission to Titan, a moon of Saturn. The state space of the example exceeds the ..."
Abstract
 Add to MetaCart
The success of complex autonomous robotic systems depends on the quality and correctness of their fault tolerant control systems. A goalbased control approach is used to design an example control program for a proposed mission to Titan, a moon of Saturn. The state space of the example exceeds the capability of existing symbolic model checkers for hybrid automata, so a novel verification method is developed. An original design for verification software tool called SBT Checker that aids in the design of modular, statebased goal trees for the control of separate tasks in the overall mission, is discussed. The combination of the individual goal trees constitute a goal network control program that can be verified against unsafe conditions using the novel InVeriant software. InVeriant converts goal networks to hybrid systems whose special structure is exploited to quickly find the reachable unsafe states. The Titan aerobot mission example is then verified using this new method. Nomenclature Γ State space of all passive state variables Λ Set of all discrete states of passive state variables D Set of passive state variables G Set of goals in a goal network Lr,k Set of executable branches of root goal g0,0r Sr,k Set containing root goal g0,0r and descendants Θk Set of executable sets of goals in group Gk ζ Set of unsafe constraints gin,jnn Goal Rk Set of root goals with descendants in Gk
A NEW POLYNOMIALTIME ALGORITHM FOR LINEAR PROGRAMMING
 COMBINATORICA
, 1984
"... We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract

Cited by 860 (3 self)
 Add to MetaCart
We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than
A new mathematical model for relative quantification in realtime RTPCR. Nucleic Acids Res
"... Use of the realtime polymerase chain reaction (PCR) to amplify cDNA products reverse transcribed from mRNA is on the way to becoming a routine tool in molecular biology to study low abundance gene expression. Realtime PCR is easy to perform, provides the necessary accuracy and produces reliable as ..."
Abstract

Cited by 1088 (4 self)
 Add to MetaCart
in comparison to a reference gene transcript. Therefore, a new mathematical model is presented. The relative expression ratio is calculated only from the realtime PCR efficiencies and the crossing point deviation of an unknown sample versus a control. This model needs no calibration curve. Control levels were
The spread of obesity in a large social network over 32 years
 NEW ENGLAND JOURNAL OF MEDICINE
, 2007
"... The prevalence of obesity has increased substantially over the past 30 years. We performed a quantitative analysis of the nature and extent of the persontoperson spread of obesity as a possible factor contributing to the obesity epidemic. Methods We evaluated a densely interconnected social networ ..."
Abstract

Cited by 509 (23 self)
 Add to MetaCart
, spouse, and neighbors. Results Discernible clusters of obese persons (bodymass index [the weight in kilograms divided by the square of the height in meters], ≥30) were present in the network at all time points, and the clusters extended to three degrees of separation. These clusters did not appear
Results 1  10
of
90,861