2254 search results - page 115 / 451 » Computing the minimal covering set |
114
click to vote
PVLDB
2010
14 years 11 months ago
2010
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
72
Voted
AIPS
2008
15 years 3 months ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
99
Voted
AAECC
1998
Springer
15 years 14 days ago
1998
Springer
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
role assignment is a programming abstraction that supports the assignment of user-defined roles to sensor nodes such that certain conditions are met. Many common network configu...
112
Voted
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
Abstract. Performance modeling is important for implementing efficient parallel applications and runtime systems. The LogP model captures the relevant aspects of message passing i...