14518 search results - page 405 / 2904 » Two Problems for Sophistication |
170
click to vote
TCS
2010
15 years 1 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
157
click to vote
FSTTCS
2007
Springer
16 years 1 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
176
click to vote
CVPR
2000
IEEE
16 years 8 months ago
2000
IEEE
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared di erences ...
283
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
A popular architecture for enterprise applications is one of a stateless object-based server accessing persistent data through Object-Relational mapping software. The reported ben...
196
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
This paper presents LOTTERYBUS, a novel high-performance communication architecture for system-on-chip (SoC) designs. The LOTTERYBUS architecture was designed to address the follo...