Sciweavers

311 search results - page 51 / 63
» Graph Classes Between Parity and Distance-hereditary Graphs
Sort
View
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 7 months ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
COMPGEOM
2006
ACM
14 years 1 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
ICSE
2000
IEEE-ACM
13 years 11 months ago
Testing levels for object-oriented software
One of the characteristicsof object-oriented software is the complex dependency that may exist between classes due to inheritance, association and aggregation relationships. Hence...
Yvan Labiche, Pascale Thévenod-Fosse, H&eac...
ACTAC
1998
71views more  ACTAC 1998»
13 years 7 months ago
On the Information Content of Semi-Structured Databases
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
Mark Levene
ICALP
2004
Springer
14 years 26 days ago
On the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Nicole Schweikardt