Sciweavers

2031 search results - page 295 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
61
Voted
HT
2009
ACM
15 years 4 months ago
On hypertext narrative
Annals and chronicles may be the foundation of accounting, but writers of stories and histories have long known that they seldom render a satisfactory account of complex events. I...
Mark Bernstein
SBCCI
2009
ACM
145views VLSI» more  SBCCI 2009»
15 years 4 months ago
Pipelined successive approximation conversion (PSAC) with error correction for a CMOS ophthalmic sensor
The purpose of this work is the proposal of a 10-Bit / 1 MSPS Analog to Digital Converter (ADC) with error correction to match the requirements of a CMOS wavefront sensor for opht...
Frank Sill, Davies W. de Lima Monteiro
TOOLS
2008
IEEE
15 years 4 months ago
Guarded Program Transformations Using JTL
There is a growing research interest in employing the logic paradigm for making queries on software in general, and OOP software in particular. We describes a side-effect-free tech...
Tal Cohen, Joseph Gil, Itay Maman
ICC
2007
IEEE
15 years 4 months ago
A Support System for Designing Ubiquitous Service Composition Scenarios
—Ubiquitous service composition provides new services and applications seamlessly by establishing cooperation among any devices in home networks and any services in service provi...
Takaaki Moriya, Hiroyuki Ohnishi, Makoto Yoshida, ...
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
15 years 4 months ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland