Sciweavers

793 search results - page 28 / 159
» Efficient computation of the characteristic polynomial
Sort
View
PAMI
2010
112views more  PAMI 2010»
13 years 6 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
FAC
2008
100views more  FAC 2008»
13 years 7 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
CVPR
2003
IEEE
14 years 9 months ago
An Efficient Solution to the Five-Point Relative Pose Problem
An efficient algorithmic solution to the classical five-point relative pose problem is presented. The problem is to find the possible solutions for relative camera motion between ...
David Nistér
CSE
2009
IEEE
13 years 11 months ago
An Efficient Privacy Preserving Keyword Search Scheme in Cloud Computing
A user stores his personal files in a cloud, and retrieves them wherever and whenever he wants. For the sake of protecting the user data privacy and the user queries privacy, a use...
Qin Liu, Guojun Wang, Jie Wu
ICSE
2004
IEEE-ACM
14 years 7 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang