4397 search results - page 147 / 880 » Relational Algebra Operations |
138
Voted
SYNASC
2008
IEEE
15 years 9 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
119
click to vote
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
133
click to vote
SAC
2003
ACM
15 years 7 months ago
2003
ACM
Existing sequence comparison software applications lack automation, abstraction, performance, and flexibility. Users need a new way of studying and applying sequence comparisons i...
116
Voted
HICSS
2012
IEEE
13 years 10 months ago
2012
IEEE
The advent of the smartphone as a highly complex technology has been accompanied by mobile operating systems (OS), large communities of developers, diverse content providers, and ...
108
Voted
ECAI
2000
Springer
15 years 7 months ago
2000
Springer
We address the problem of advice-taking in a given domain, in particular for building a game-playing program. Our approach to solving it strives for the application of machine lea...