1629 search results - page 65 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
KDD
1995
ACM
15 years 1 months ago
1995
ACM
Data mining or knowledge discovery in databasesis the search for relationships and global patterns that exist but are hidden in large databases.Many different methodshave been pro...
108
click to vote
COLT
2010
Springer
14 years 7 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
DAC
2009
ACM
15 years 1 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
ANTSW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Wireless Sensor Networks are characterized by having specific requirements such as limited energy availability, low memory and reduced processing power. On the other hand...
ENTCS
2008
14 years 9 months ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...