Sciweavers

7839 search results - page 1495 / 1568
» What's Clicking What
Sort
View
EJC
2007
15 years 21 days ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
85
Voted
KI
2008
Springer
15 years 21 days ago
Wayfinding in Scene Space
Many environments in which humans wayfind can be conveniently abstracted as networks or graphs: structures of nodes that are interconnected by edges. Examples include the street ne...
Urs-Jakob Rüetschi
JLP
2006
155views more  JLP 2006»
15 years 21 days ago
A formally grounded software specification method
One of the goals of software engineering is to provide what is necessary to write relevant, legible, useful descriptions of the systems to be developed, which will be the basis of...
Christine Choppy, Gianna Reggio
109
Voted
JMLR
2006
113views more  JMLR 2006»
15 years 21 days ago
On Inferring Application Protocol Behaviors in Encrypted Network Traffic
Several fundamental security mechanisms for restricting access to network resources rely on the ability of a reference monitor to inspect the contents of traffic as it traverses t...
Charles V. Wright, Fabian Monrose, Gerald M. Masso...
LOGCOM
2008
94views more  LOGCOM 2008»
15 years 21 days ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
« Prev « First page 1495 / 1568 Last » Next »