5100 search results - page 645 / 1020 » The Linear Complexity of a Graph |
255
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Local invariant feature based methods have been proven to be effective in computer vision for object recognition and learning. But for an image, the number of points detected and ...
159
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...
204
click to vote
KBSE
2008
IEEE
16 years 1 months ago
2008
IEEE
—Automated tests are important for Web applications as they grow more complex day by day. Web application testing frameworks have emerged to help satisfy this need. However, used...
159
click to vote
AINA
2007
IEEE
16 years 1 months ago
2007
IEEE
In hierarchical distributed systems, shared data access can be controlled by assigning user groups single cryptographic keys that allow high level users derive low level keys, but...
217
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...