Sciweavers

395 search results - page 49 / 79
» Decision Problems for Convex Languages
Sort
View
VLSISP
2010
254views more  VLSISP 2010»
13 years 5 months ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...
PPDP
2005
Springer
14 years 1 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...
VL
2002
IEEE
100views Visual Languages» more  VL 2002»
14 years 13 days ago
Using HCI Techniques to Design a More Usable Programming System
A programming system is the user interface between the programmer and the computer. Programming is a notoriously difficult activity, and some of this difficulty can be attribute...
John F. Pane, Brad A. Myers, Leah B. Miller
HIPS
1998
IEEE
13 years 11 months ago
ZPL's WYSIWYG Performance Model
ZPL is a parallel array language designed for high performance scientific and engineering computations. Unlike other parallel languages, ZPL is founded on a machine he CTA) that a...
Bradford L. Chamberlain, Sung-Eun Choi, E. Christo...
FSTTCS
2010
Springer
13 years 5 months ago
Parityizing Rabin and Streett
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
Udi Boker, Orna Kupferman, Avital Steinitz