Results 1  10
of
174
Distortion invariant object recognition in the dynamic link architecture
 IEEE Transactions on Computers
, 1993
"... AbstractWe present an object recognition system based ..."
Abstract

Cited by 491 (54 self)
 Add to MetaCart
AbstractWe present an object recognition system based
IDMaps: A Global Internet Host Distance Estimation Service
 In Proceedings of IEEE INFOCOM
, 2000
"... There is an increasing need to quickly and efficiently learn network distances, in terms of metrics such as latency or bandwidth, between Internet hosts. For example, Internet content providers often place data and server mirrors throughout the Internet to improve access latency for clients, and it ..."
Abstract

Cited by 254 (13 self)
 Add to MetaCart
There is an increasing need to quickly and efficiently learn network distances, in terms of metrics such as latency or bandwidth, between Internet hosts. For example, Internet content providers often place data and server mirrors throughout the Internet to improve access latency for clients, and it is necessary to direct clients to the closest mirrors based on some distance metric in order to realize the benefit of mirrors. We suggest a scalable Internetwide architecture, called IDMaps, which measures and disseminates distance information on the global Internet. Higherlevel services can collect such distance information to build a virtual distance map of the Internet and estimate the distance between any pair of IP addresses. We present our solutions to the measurement server placement and distance map construction problems in IDMaps. We show that IDMaps can indeed provide useful distance estimations to applications such as closestmirror selection. 1 Keywords: network service, distributed algorithms, scalability, modeling. 1
Easy Problems for TreeDecomposable Graphs
, 1991
"... this paper are (i) a construction by which, for a given bounded treewidth, a general MS graph property P is transformed to an MS binary tree property r(P), and a general labeled graph G with a suitable treedecomposition is transformed to a labeled binary tree T(G) in time linear in the number of v ..."
Abstract

Cited by 230 (6 self)
 Add to MetaCart
this paper are (i) a construction by which, for a given bounded treewidth, a general MS graph property P is transformed to an MS binary tree property r(P), and a general labeled graph G with a suitable treedecomposition is transformed to a labeled binary tree T(G) in time linear in the number of vertices of G and in such a way that P holds for G if and only if r(P) holds for T(G). This allows us, using techniques developed by Doner [20] and Thatcher and Wright [42], to compile a tree automaton which decides the MSproblem r(P) on the tree T(G) (and thus also P on the graph G) in linear time, and (ii) a procedure whereby such an automaton for a MS formula with free variables is modified to solve a related EMS problem involving counting
Analytical methods for dynamic simulation of nonpenetrating rigid bodies
 In Proc. of ACM SIGGRAPH ’89
, 1989
"... A method for analytically calculating the forces between systems of rigid bodies in resting (noncolliding) contact is presented. The systems of bodies may either be in motion or static equilibrium and adjacent bodies may touch at multiple points. The analytic formulation of the forces between bodie ..."
Abstract

Cited by 182 (8 self)
 Add to MetaCart
A method for analytically calculating the forces between systems of rigid bodies in resting (noncolliding) contact is presented. The systems of bodies may either be in motion or static equilibrium and adjacent bodies may touch at multiple points. The analytic formulation of the forces between bodies in noncolliding contact can be modified to deal with colliding bodies. Accordingly, an improved method for analytically calculating the forces between systems of rigid bodies in colliding contact is also presented. Both methods can be applied to systems with arbitrary holonomic geometric constraints, such as linked figures. The analytical formulations used treat both holonomic and nonholonomic constraints in a consistent manner.
Analyzing regression test selection techniques
 IEEE Transactions on Software Engineering
, 1996
"... AbstractRegression testing is a necessary but expensive maintenance activity aimed at showing that code has not been adversely affected by changes. Regression test selection techniques reuse tests from an existing test suite to test a modified program. Many regression test selection techniques have ..."
Abstract

Cited by 160 (42 self)
 Add to MetaCart
AbstractRegression testing is a necessary but expensive maintenance activity aimed at showing that code has not been adversely affected by changes. Regression test selection techniques reuse tests from an existing test suite to test a modified program. Many regression test selection techniques have been proposed; however, it is difficult to compare and evaluate these techniques because they have different goals. This paper outlines the issues relevant to regression test selection techniques, and uses these issues as the basis for a framework within which to evaluate the techniques. We illustrate the application of our framework by using it to evaluate existing regression test selection techniques. The evaluation reveals the strengths and weaknesses of existing techniques, and highlights some problems that future work in this area should address. Index TermsSoftware maintenance, regression testing, selective retest, regression test selection. 1
Hybrid Evolutionary Algorithms for Graph Coloring
, 1998
"... A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary algorithms. In this paper, we present such hybrid algorithms for the graph coloring problem. These algorithms combine a new class of highly specialized crossover operators ..."
Abstract

Cited by 105 (14 self)
 Add to MetaCart
A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary algorithms. In this paper, we present such hybrid algorithms for the graph coloring problem. These algorithms combine a new class of highly specialized crossover operators and a wellknown tabu search algorithm. Experiments of such a hybrid algorithm are carried out on large DIMACS Challenge benchmark graphs. Results prove very competitive with and even better than those of stateoftheart algorithms. Analysis of the behavior of the algorithm sheds light on ways to further improvement. Keywords: Graph coloring, solution recombination, tabu search, combinatorial optimization. 1 Introduction A recent and very promising approach for combinatorial optimization is to embed local search into the framework of population based evolutionary algorithms, leading to hybrid evolutionary algorithms (HEA). Such an algorithm is essentially based on two key elements: an eff...
Effect of Test Set Minimization on Fault Detection Effectiveness
, 1995
"... Size and code coverage are important attributes of a set of tests. When a program P is executed on elements of the test set T, we can observe the fault detecting capability of T for P. We can also observe the degree to which T induces code coverage on P according to some coverage criterion. We woul ..."
Abstract

Cited by 85 (4 self)
 Add to MetaCart
Size and code coverage are important attributes of a set of tests. When a program P is executed on elements of the test set T, we can observe the fault detecting capability of T for P. We can also observe the degree to which T induces code coverage on P according to some coverage criterion. We would like to know whether it is the size of T or the coverage of T on P which determines the fault detection effectiveness of T for P. To address this issue we ask the following question: While keeping coverage constant, what is the effect on fault detection of reducing the size of a test set? We report results from an empirical study using the block and alluses criteria as the coverage measures.
Coping with Friction for Nonpenetrating Rigid Body Simulation
, 1991
"... Algorithms and computational complexity measures for simulating the motion of contacting bodies with friction are presented. The bodies are restricted to be perfectly rigid bodies that contact at finitely many points. Contact forces between bodies must satisfy the Coulomb model of friction. A tradit ..."
Abstract

Cited by 81 (0 self)
 Add to MetaCart
Algorithms and computational complexity measures for simulating the motion of contacting bodies with friction are presented. The bodies are restricted to be perfectly rigid bodies that contact at finitely many points. Contact forces between bodies must satisfy the Coulomb model of friction. A traditional principle of mechanics is that contact forces are impulsive if and only if nonimpulsive contact forces are insufficient to maintain the nonpenetration constraints between bodies. When friction is allowed, it is known that impulsive contact forces can be necessary even in the absence of collisions between bodies. This paper shows that computing contact forces according to this traditional principle is likely to require exponential time. An analysis of this result reveals that the principle for when impulses can occur is too restrictive, and a natural reformulation of the principle is proposed. Using the reformulated principle, an algorithm with expected polynomial time behavior for co...
A Robust Model for Finding Optimal Evolutionary Trees
, 1993
"... Constructing evolutionary trees for species sets is a fundamental problem in computational biology. One of the standard models assumes the ability to compute distances between every pair of species and seeks to find an edgeweighted tree T in which the distance d T ij in the tree between the leaves ..."
Abstract

Cited by 78 (14 self)
 Add to MetaCart
Constructing evolutionary trees for species sets is a fundamental problem in computational biology. One of the standard models assumes the ability to compute distances between every pair of species and seeks to find an edgeweighted tree T in which the distance d T ij in the tree between the leaves of T corresponding to the species i and j exactly equals the observed distance, d ij . When such a tree exists, this is expressed in the biological literature by saying that the distance function or matrix is additive, and trees can be constructed from additive distance matrices in O(n 2 ) time. Real distance data is hardly ever additive, and we therefore need ways of modeling the problem of finding the bestfit tree as an optimization problem. In this paper we present several natural and realistic ways of modeling the inaccuracies in the distance data. In one model we assume that we have upper and lower bounds for the distances between pairs of species and try to find an additive distanc...
Hardware/Software CoDesign
 IEEE MICRO
, 1997
"... ... This paper introduces the reader to various aspects of codesign. We highlight the commonalities and point out the differences in various codesign problems in some application areas. Codesign issues and their relationship to classical system implementation tasks are discussed to help the reade ..."
Abstract

Cited by 77 (0 self)
 Add to MetaCart
... This paper introduces the reader to various aspects of codesign. We highlight the commonalities and point out the differences in various codesign problems in some application areas. Codesign issues and their relationship to classical system implementation tasks are discussed to help the reader develop a perspective on modern digital system design that relies on computeraided design (CAD) tools and methods.