Sciweavers

544 search results - page 88 / 109
» What cannot be computed locally!
Sort
View
SAT
2009
Springer
132views Hardware» more  SAT 2009»
14 years 3 months ago
Relaxed DPLL Search for MaxSAT
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
Lukas Kroc, Ashish Sabharwal, Bart Selman
CIVR
2007
Springer
361views Image Analysis» more  CIVR 2007»
14 years 3 months ago
Interpretability based interest points detection
This paper deals with a new interest points detector. Unlike most standard detectors which concentrate on the local shape of the signal, the main objective of this new operator is...
Ahmed Rebai, Alexis Joly, Nozha Boujemaa
ESCIENCE
2006
IEEE
14 years 2 months ago
Supporting Decentralized, Security Focused Dynamic Virtual Organizations across the Grid
The ability to dynamically create and subsequently manage secure virtual organisations (VO) is one of the key challenges facing the Grid community. Existing approaches for establi...
Richard O. Sinnott, David W. Chadwick, Jos Koetsie...
AINTEC
2005
Springer
14 years 2 months ago
Users and Services in Intelligent Networks
— We present a vision of an Intelligent Network in which users dynamically indicate their requests for services, and formulate needs in terms of Quality of Service (QoS) and pric...
Erol Gelenbe
ICDM
2003
IEEE
140views Data Mining» more  ICDM 2003»
14 years 2 months ago
Mining Frequent Itemsets in Distributed and Dynamic Databases
Traditional methods for frequent itemset mining typically assume that data is centralized and static. Such methods impose excessive communication overhead when data is distributed...
Matthew Eric Otey, Chao Wang, Srinivasan Parthasar...