Sciweavers

8636 search results - page 357 / 1728
» How Developers Copy
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
15 years 4 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
UIST
2010
ACM
15 years 4 months ago
Pen + touch = new tools
We describe techniques for direct pen+touch input. We observe people's manual behaviors with physical paper and notebooks. These serve as the foundation for a prototype Micro...
Ken Hinckley, Koji Yatani, Michel Pahud, Nicole Co...
FAST
2009
15 years 4 months ago
A Framework for Fine-grained Data Integration and Curation, with Provenance, in a Dataspace
Some tasks in a dataspace (a loose collection of heterogeneous data sources) require integration of fine-grained data from diverse sources. This work is often done by end users kn...
David W. Archer, Lois M. L. Delcambre, David Maier
ICC
2009
IEEE
150views Communications» more  ICC 2009»
15 years 4 months ago
Efficient Resource Discovery in Mobile Ad Hoc Networks
Abstract--The highly dynamic nature of infrastructureless adhoc networks poses new challenges during resource discovery. In this paper, we propose a novel algorithm for resource di...
Ravi Thanawala, Jie Wu, Avinash Srinivasan
COMBINATORICA
2010
15 years 4 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel