Sciweavers

3394 search results - page 605 / 679
» A Space and Time Efficient Algorithm for SimRank Computation
Sort
View
ACMSE
2004
ACM
14 years 2 months ago
Trust based adaptive on demand ad hoc routing protocol
In this paper, we propose a routing protocol that is based on securing the routing information from unauthorized users. Even though routing protocols of this category are already ...
Rajiv K. Nekkanti, Chung-wei Lee
EMSOFT
2004
Springer
14 years 2 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 1 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
CIVR
2007
Springer
180views Image Analysis» more  CIVR 2007»
14 years 3 months ago
Probabilistic matching and resemblance evaluation of shapes in trademark images
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
Helmut Alt, Ludmila Scharf, Sven Scholz
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 1 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...