Sciweavers

35 search results - page 4 / 7
» Removing Independently Even Crossings
Sort
View
JPDC
2006
83views more  JPDC 2006»
13 years 5 months ago
Virtual Leashing: Creating a computational foundation for software protection
We introduce Virtual Leashing,1 a new technique for software protection and control. The leashing process removes small fragments of code, pervasive throughout the application, an...
Ori Dvir, Maurice Herlihy, Nir Shavit
CLEF
2009
Springer
13 years 6 months ago
UNIBA-SENSE @ CLEF 2009: Robust WSD Task
This paper presents the participation of the semantic N-levels search engine SENSE at the CLEF 2009 Ad Hoc Robust-WSD Task. During the participation at the same task of CLEF 2008,...
Pierpaolo Basile, Annalina Caputo, Giovanni Semera...
COLING
2010
13 years 5 days ago
Multiword Expressions in the wild? The mwetoolkit comes in handy
The mwetoolkit is a tool for automatic extraction of Multiword Expressions (MWEs) from monolingual corpora. It both generates and validates MWE candidates. The generation is based...
Carlos Ramisch, Aline Villavicencio, Christian Boi...
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
13 years 8 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
ECCC
2007
124views more  ECCC 2007»
13 years 5 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler