Sciweavers

727 search results - page 129 / 146
» One line and n points
Sort
View
ANTS
1998
Springer
114views Algorithms» more  ANTS 1998»
15 years 2 months ago
Dense Admissible Sets
Call a set of integers {b1, b2, . . . , bk} admissible if for any prime p, at least one congruence class modulo p does not contain any of the bi. Let (x) be the size of the largest...
Daniel M. Gordon, Eugene R. Rodemich
APN
1994
Springer
15 years 2 months ago
On the Model of Computation of Place/Transition Petri Nets
Abstract. In the last few years, the semantics of Petri nets has been investigated in several different ways. Apart from the classical "token game", one can model the beh...
José Meseguer, Ugo Montanari, Vladimiro Sas...
ICDAR
2007
IEEE
15 years 1 months ago
On Computing Strength of Evidence for Writer Verification
The problem of Writer Verification is to make a decision of whether or not two handwritten documents are written by the same person. Providing a strength of evidence for any such ...
Harish Srinivasan, S. Kabra, Chen Huang, Sargur N....
REST
2010
ACM
14 years 11 months ago
A formal definition of RESTful semantic web services
In this article a formal model applying REST architectural principles to the description of semantic web services is introduced, including the discussion of its syntax and operati...
Antonio Garrote Hernández, María N. ...
CGF
2010
105views more  CGF 2010»
14 years 10 months ago
Visibility Editing For All-Frequency Shadow Design
We present an approach for editing shadows in all-frequency lighting environments. To support artistic control, we propose to decouple shadowing from lighting and focus on providi...
Juraj Obert, Fabio Pellacini, Sumanta N. Pattanaik