Sciweavers

505 search results - page 18 / 101
» Approximate databases: a support tool for approximate reason...
Sort
View
AAAI
2007
13 years 10 months ago
Approximating OWL-DL Ontologies
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...
Jeff Z. Pan, Edward Thomas
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 9 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou
BMCBI
2011
12 years 11 months ago
Conotoxin Protein Classification Using Free Scores of Words and Support Vector Machines
Background: Conotoxin has been proven to be effective in drug design and could be used to treat various disorders such as schizophrenia, neuromuscular disorders and chronic pain. ...
Nazar Zaki, Stefan Wolfsheimer, Grégory Nue...
DIS
2004
Springer
14 years 1 months ago
Tiling Databases
Abstract. In this paper, we consider 0/1 databases and provide an alternative way of extracting knowledge from such databases using tiles. A tile is a region in the database consis...
Floris Geerts, Bart Goethals, Taneli Mielikäi...
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
13 years 6 months ago
On Nash-Equilibria of Approximation-Stable Games
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...