Sciweavers

6104 search results - page 902 / 1221
» Constructing Information Bases Using Associative Structures
Sort
View
135
Voted
LATIN
2010
Springer
15 years 11 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
114
Voted
ADHOCNOW
2008
Springer
15 years 11 months ago
Query Dissemination with Predictable Reachability and Energy Usage in Sensor Networks
Energy-efficient query dissemination plays an important role for the lifetime of sensor networks. In this work, we consider probabilistic flooding for query dissemination and deve...
Zinaida Benenson, Markus Bestehorn, Erik Buchmann,...
117
Voted
ATAL
2007
Springer
15 years 10 months ago
Distributed coordination in uncertain multiagent systems
We consider real-time multi-agent coordination in a dynamic and uncertain domain addressing both distributed state information and partial knowledge of the common reward function....
Rajiv T. Maheswaran, Craig Milo Rogers, Romeo Sanc...
SEMWEB
2007
Springer
15 years 10 months ago
The PRIOR+: Results for OAEI Campaign 2007
Ontology mapping is to find semantic correspondences between similar elements of different ontologies. It is critical to achieve semantic interoperability in the WWW. This paper su...
Ming Mao, Yefei Peng
IRI
2006
IEEE
15 years 10 months ago
Replacing full rectangles by dense rectangles: Concept lattices and attribute implications
— Maximal full rectangles in tabular data are useful in several areas of data engineering. This paper presents a survey of results in which we replace “full rectangles” by ...
Radim Belohlávek, Vilém Vychodil