874 search results - page 106 / 175 » Faster Algorithms for Semi-Matching Problems |
CSREASAM
2006
14 years 11 months ago
2006
- Although Internet serves many contents and services, it has serious problems of security: the invasion of privacy, hacking and etc. To prevent these problems, two implementations...
103
click to vote
EDBT
2012
ACM
13 years 10 days ago
2012
ACM
In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
ASPDAC
2004
ACM
15 years 3 months ago
2004
ACM
As gate delays decrease faster than wire delays for each technology generation, buffer insertion becomes a popular method to reduce the interconnect delay. Several modern buffer in...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative m...
SASP
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper, we present Parade, a novel and flexible parallel architecture for the deinterleaving of combined pulsetrains. This is a commonly performed task in various areas ...