Sciweavers

925 search results - page 43 / 185
» Connectivity on Complete Lattices
Sort
View
UIST
2006
ACM
15 years 5 months ago
Huddle: automatically generating interfaces for systems of multiple connected appliances
Systems of connected appliances, such as home theaters and presentation rooms, are becoming commonplace in our homes and workplaces. These systems are often difficult to use, in p...
Jeffrey Nichols, Brandon Rothrock, Duen Horng Chau...
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
15 years 1 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
ESANN
2003
15 years 1 months ago
Autonomous learning algorithm for fully connected recurrent networks
In this paper fully connected RTRL neural networks are studied. In order to learn dynamical behaviours of linear-processes or to predict time series, an autonomous learning algori...
Edouard Leclercq, Fabrice Druaux, Dimitri Lefebvre
ALGORITHMICA
2010
147views more  ALGORITHMICA 2010»
14 years 12 months ago
Note on the Structure of Kruskal's Algorithm
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
Nicolas Broutin, Luc Devroye, Erin McLeish
WMCSA
2009
IEEE
15 years 6 months ago
We saw each other on the subway: secure, anonymous proximity-based missed connections
There is an inherent tension between the value provided by Location-Based Services (LBSs) and the location-privacy concerns they raise. Unfortunately, users are often forced to ei...
Justin Manweiler, Ryan Scudellari, Zachary Cancio,...