4940 search results - page 866 / 988 » On the Complexity of Universal Programs |
177
click to vote
DOCENG
2010
ACM
15 years 7 months ago
2010
ACM
Building authoring applications is a tedious and complex task that requires a high programming effort. Document technologies, especially XML based ones, can help in reducing such ...
142
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
A variety of computation models have been developed using graphs and graph transformations. These include models for sequential, distributed, parallel or mobile computation. A grap...
174
click to vote
GRID
2008
Springer
15 years 7 months ago
2008
Springer
Desktop Grids have emerged as an important methodology to harness the idle cycles of millions of participant desktop PCs over the Internet. However, to effectively utilize the res...
188
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
180
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...