Sciweavers

1968 search results - page 105 / 394
» The Complexity of Valued Constraint Models
Sort
View
ER
2007
Springer
108views Database» more  ER 2007»
15 years 7 months ago
Reasoning over Extended ER Models
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
15 years 6 months ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
SMI
2005
IEEE
15 years 7 months ago
Maximizing Adaptivity in Hierarchical Topological Models
We present an approach to hierarchically encode the topology of functions over triangulated surfaces. We describe the topology of a function by its Morse-Smale complex, a well kno...
Peer-Timo Bremer, Valerio Pascucci, Bernd Hamann
WWW
2005
ACM
16 years 2 months ago
SemRank: ranking complex relationship search results on the semantic web
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
14 years 12 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis